Some Simple Calculations in Relative Discrete Time Process Algebra

نویسنده

  • J.C.M. Baeten
چکیده

We do some simple calculations involving buffers in discrete time process algebra with relative timing. Note: Dedicated to prof.dr. F.E.J. Kruseman Aretz, on the occasion of his ‘afscheidscollege’.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete time process algebra with silent step

Abstract The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are pres...

متن کامل

IDEAL J *-ALGEBRAS

A C *-algebra A is called an ideal C * -algebra (or equally a dual algebra) if it is an ideal in its bidual A**. M.C.F. Berglund proved that subalgebras and quotients of ideal C*-algebras are also ideal C*-algebras, that a commutative C *-algebra A is an ideal C *-algebra if and only if it is isomorphicto C (Q) for some discrete space ?. We investigate ideal J*-algebras and show that the a...

متن کامل

Discrete Time Process Algebra with Relative Timing

Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...

متن کامل

Comparing the Eeciency of Asynchronous Systems Motivation and Introduction

A timed process algebra is developed for evaluating the temporal worst-case eeciency of asynchronous concurrent systems. For the sake of simplicity, we use a classical CCS-like algebra where actions may occur arbitrarily within a continuous time interval, yielding arbitrary relative speeds of the components. Via the timed testing approach, asynchronous systems are then related w.r.t. their wors...

متن کامل

Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time

We discuss the key notions of discrete time process algebra in the setting of ACP. Time is measured in discrete slices. The emphasis is on absolute, relative and parametric time notation. Note: Partial support received from ESPRIT Basic Research Action 7166, CONCUR2. Published in Fundamenta Informaticae 29 (112), 1997, pp. 51-76.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995